Common Items on a Bucket List

On $t$-Common List-Colorings

In this paper, we introduce a new variation of list-colorings. For a graph G and for a given nonnegative integer t, a t-common list assignment of G is a mapping L which assigns each vertex v a set L(v) of colors such that given set of t colors belong to L(v) for every v ∈ V (G). The t-common list chromatic number of G denoted by cht(G) is defined as the minimum positive integer k such that ther...

Problems of Optimization in Learning a List of Simple Items

Collaborative Filtering Similarity Algorithm Using Common Items

Collaborative filtering (CF) plays an important role in reducing information overload by providing personalized services. CF is widely applied, but common items are not taken account in the similarity algorithm, which reduces the recommendation effect. To address this issue, we propose several methods to improve the similarity algorithm by considering common items, and apply the proposed method...

Using the Swadesh list for creating a simple common taxonomy

The long-term goal of the research described in this paper is to develop a multilingual language resource linked to the Princeton WordNet. The paper describes the experiments we are conducing for determining a basic vocabulary and for designing a language-independent core for the future resource. More precisely, in this paper we use the universality of the Swadesh list [15] for selecting it as ...

Effects of delay and number of related list items on implicit activation for DRM critical items in a speeded naming task

Two experiments examined decay and additivity of semantic priming produced by DRM false memory lists on a naming task. Subjects were presented with study lists containing 14 DRM items that were either all 14 related, the first 7 related, the second 7 related, or all 14 unrelated to the non-presented critical item. Priming was measured on a naming task that presented the critical item in test po...